Transmission methods for downlink ACK/NACK channels

ABSTRACT

A method from transmitting data via multiple antennas. In this method, four information bits to be transmitted are multiplexed by using either one of a code division multiplexing scheme or a second code division multiplexing scheme combined with a real and imaginary multiplexing scheme, to generate a code division multiplexed symbol including four vectors. Then, the code division multiplexed symbol is repeatedly transmitted by alternatively applying two transmit diversity schemes via four transmission antennas.

CLAIM OF PRIORITY

This application makes reference to, claims all benefits accruing under35 U.S.C. §119 from, and incorporates herein, a U.S. ProvisionalApplication entitled TRANSMISSION METHODS FOR DOWNLINK ACK/NACK CHANNELSfiled in the U.S. Patent & Trademark Office on 3 Aug. 2007 and thereduly assigned Ser. No. 60/935,300.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to methods and apparatus for efficientlytransmitting downlink acknowledgement channel messages.

2. Description of the Related Art

A typical cellular radio system includes a number of fixed base stationsand a number of mobile stations (user equipment). Each base stationcovers a geographical area, which is defined as a cell.

During an uplink transmission in the Third (3^(rd)) GenerationPartnership Project Long Term Evolution (3GPP LTE) systems, a unit ofuser equipment (UE) transmits a data packet to a base station (BS) afterreceiving an uplink scheduling grant (i.e., uplink grant) from the BS.In response to the received data packet from the UE, the BS transmits adownlink acknowledgement message (i.e., downlink ACK) to the UE. Duringa downlink transmission, a BS transmits a data packet to a UE aftertransmitting a downlink scheduling grant (i.e., downlink grant) to theUE. In response to the received data packet from the BS, the UEtransmits an uplink acknowledgement message (i.e., uplink ACK) to theUE.

In the case of four transmission antennas (4Tx), the Space-FrequencyBlock Code combined with Frequency Switched Transmit Diversity(SFBC+FSTD) transmission matrix is adopted in LTE standard according to“Chairman's notes”, of Orlando 3GPP LTE RAN1 49bis meeting held in June2007.

In addition, Code division multiplex (CDM) based Acknowledgement andNegative Acknowledgement (ACK/NACK) multiplexing and its transmitdiversity scheme for two transmission antennas (2Tx) case has beenproposed in “Performance of DL ACK/NACK transmission”, 3GPP R1-071805,published by Samsung in March 2007, and “Downlink ACK/NACK Transmitdiversity”, 3GPP R1-073099, published by Samsung in June 2007, tomultiplex the information bits of acknowledgement channel signals.

CDM ACK/NACK approach, however, does not immediately work with the 4TxSFBC+FSTD transmit diversity scheme, because the CDM orthogonality islost after the 4x SFBC+FSTD operation.

SUMMARY OF THE INVENTION

It is therefore an object of the present invention to provide animproved method and transmitter circuit for transmitting data viamultiple antennas.

It is another object of the present invention to provide transmitdiversity schemes via four transmission antennas that are compatiblewith the CDM ACK/NACK multiplexing structure.

According to one aspect of the present invention, a method fortransmitting data is provided. In this method, four information bits tobe transmitted are multiplexed by using one of a first code divisionmultiplexing scheme and a second code division multiplexing schemecombined with a real and imaginary multiplexing scheme, to generate acode division multiplexed symbol a including four vectors a=[a₁, . . . ,a₄]. Then, the code division multiplexed symbol a is repeatedlytransmitted by alternatively applying two transmit diversity schemes viafour transmission antennas.

In a first transmit diversity scheme, a transmit signal may beestablished by:

${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*} \\0 & 0 & 0 & 0\end{bmatrix}},$

where T_(ij) represents the symbol transmitted on the i-th antenna andthe j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4. In a secondtransmit diversity scheme, a transmit signal may be established by:

$\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}0 & 0 & 0 & 0 \\a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}$

where T_(ij) represents the symbol transmitted on the i-th antenna andthe j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4.

Alternatively, in a first transmit diversity scheme, a transmit signalmay be established by:

${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & a_{2} & 0 & 0 \\0 & 0 & a_{3} & a_{4} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}},$

where T_(ij) represents the symbol transmitted on the i-th antenna andthe j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4. In a secondtransmit diversity scheme, a transmit signal may be established by:

$\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}0 & 0 & a_{3} & a_{4} \\a_{1} & a_{2} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0\end{bmatrix}$

where T_(ij) represents the symbol transmitted on the i-th antenna andthe j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4.

In accordance with the first code division multiplexing scheme, the codedivision multiplexed symbol a may be established by:

$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{4}b_{4}}\end{bmatrix}}}$

where b=[b₁, . . . , b₄] indicates the four information bits, S=[s₁, . .. , s₄] indicates a unitary spreading matrix where each spreading vectors₁, . . . , s₄ is of size 1×4, W=diag[w₁, . . . w₄] is a diagonal matrixindicating transmission amplitudes of the information bits.

In accordance with the second code division multiplexing scheme combinedwith the real and imaginary multiplexing scheme, the code divisionmultiplexed symbol a may be established by:

$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{4,i}b_{4,i}} + {j\; w_{4,q}b_{4,q}}}\end{bmatrix}}}$

where b_(i)[b_(1,i), . . . , b_(4,i)] indicates the four informationbits to be carried on a real branch, b_(q)=[b_(1,q), . . . , b_(4,q)]indicates the four information bits to be carried on an imaginarybranch, S=[s₁, . . . , s₄] indicates a unitary spreading matrix whereeach spreading vector s₁, . . . , s₄ is of size 1×4, andW_(i)=diag└w_(1,i), . . . , w_(4,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(4,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.

The first transmit diversity scheme may be applied on even-numberedrepetitions; while the second transmit diversity scheme may be appliedon odd-numbered repetitions.

Alternatively, the first transmit diversity scheme may be applied onodd-numbered repetitions; while the second transmit diversity scheme maybe applied on even-numbered repetitions.

When the number of repetitions is even, transmitting even number ofrepetitions by the two transmit diversity schemes may be alternativelyapplied in at least one time unit among a plurality of time units withina subframe. In this case, all of the repetitions may be assigned in atime unit selected from the plurality of time units within a subframe.Alternatively, a first subset of the repetitions may be assigned in afirst time unit, and a second subset of the repetitions may be assignedin a second time unit, with each of the first subset and the secondsubset including even number of repetitions.

According to another aspect of the present invention, a method fortransmitting data is provided. In this method, three information bits tobe transmitted are multiplexed by using one of a first code divisionmultiplexing scheme and a second code division multiplexing schemecombined with a real and imaginary multiplexing scheme, to generate acode division multiplexed symbol a including three vectors a=[a₁, . . ., a₃]. The code division multiplexed symbol a is then repeatedlytransmitted by applying a transmit diversity scheme via fourtransmission antennas.

The transmit signal may be established by:

${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & 0 & a_{2} & {- a_{3}} \\0 & a_{1} & a_{3}^{*} & a_{2}^{*} \\{- a_{2}^{*}} & {- a_{3}} & a_{1}^{*} & 0 \\a_{3}^{*} & {- a_{2}} & 0 & a_{1}^{*}\end{bmatrix}},$

where T_(ij) represents the symbol transmitted on the i-th antenna andthe j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4.

In accordance with the first code division multiplexing scheme, the codedivision multiplexed symbol a may be established by:

$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{3}b_{3}}\end{bmatrix}}}$

where b=[b₁, . . . , b₃] indicates the four information bits, S=[s₁, . .. , s₃] indicates a unitary spreading matrix where each spreading vectors₁, . . . , s₃ is of size 1×3, W=diag[w₁, . . . , w₃] is a diagonalmatrix indicating transmission amplitudes of the information bits.

In accordance with the second code division multiplexing scheme combinedwith the real and imaginary multiplexing scheme, the code divisionmultiplexed symbol a being established by:

$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{3,i}b_{3,i}} + {j\; w_{3,q}b_{3,q}}}\end{bmatrix}}}$

where b_(i)=[b_(1,i), . . . , b_(3,i)] indicates the four informationbits to be carried on a real branch, b_(q)=[b_(1,q), . . . , b_(3,q)]indicates the four information bits to be carried on an imaginarybranch, S=[s₁, . . . , s₃] indicates a unitary spreading matrix whereeach spreading vector s₁, . . . , s₃ is of size 1×3, andW_(i)=diag└w_(1,i), . . . , w_(3,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(3,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.

The code division multiplexed symbol a may be transmitted for threerepetitions by using a resource mapping scheme selected from a firstresource mapping scheme and a second resource mapping scheme. When thefirst resource mapping scheme is selected, the three repetitions aretransmitted in a time unit among a plurality of time units within asubframe; when the second resource mapping scheme is selected, the threerepetitions are transmitted in three time units among the plurality oftime units within the subframe, with each repetition corresponding toone time unit.

Alternatively, the code division multiplexed symbol a may be repeatedlytransmitted for a plurality of times by using a resource mapping schemeselected from a first resource mapping scheme and a second resourcemapping scheme. When the first resource mapping scheme is selected, theplurality of repetitions are transmitted in a time unit among aplurality of time units within a subframe; when the second resourcemapping scheme is selected, the plurality of repetitions are transmittedin three time units among the plurality of time units within thesubframe by assigning roughly equal number of repetitions to each one ofthe three time units.

An index, k(n), of the time unit assigned to an n-th repetition may beestablished by:

${k(n)} = \left\{ {\begin{matrix}0 & {{{if}\mspace{14mu} n} \leq \left\lceil {N\text{/}3} \right\rceil} \\1 & {{{if}\mspace{14mu} n} \leq {2 \cdot \left\lceil {N\text{/}3} \right\rceil}} \\2 & {{{if}\mspace{14mu} n} > {2 \cdot \left\lceil {N\text{/}3} \right\rceil}}\end{matrix},} \right.$

where N is the total number of the repetitions.

Alternatively, the index, k(n), of the time unit assigned to an n-threpetition being established by:

k(n)=mod(N−1,3)

where N is the total number of the repetitions.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete appreciation of the invention, and many of the attendantadvantages thereof, will be readily apparent as the same becomes betterunderstood by reference to the following detailed description whenconsidered in conjunction with the accompanying drawings in which likereference symbols indicate the same or similar components, wherein:

FIG. 1 schematically illustrates an Orthogonal Frequency DivisionMultiplexing (OFDM) transceiver chain suitable for the practice of theprinciples of the present inventions;

FIG. 2 schematically illustrates downlink assignment control signalingin a 3G LTE system;

FIG. 3 schematically illustrates uplink assignment control signaling ina 3G LTE system;

FIG. 4 schematically illustrates a mapping scheme of Physical DownlinkControl Channel (PDCCH) and reference signals within a subframe;

FIG. 5 schematically illustrates a mapping scheme of LTE downlinkcontrol channel elements and control channel candidate sets;

FIG. 6 schematically illustrates a Space Time Block Code (STBC)transmission diversity scheme for two transmission antennas;

FIG. 7 schematically illustrates a Space Frequency Block Code (SFBC)transmission diversity scheme for two transmission antennas;

FIG. 8 schematically illustrates a Code Division Multiplex (CDM)combined with Space Frequency Block Code (SFBC) and repetition scheme;

FIG. 9 schematically illustrates a Code Division multiplex (CDM)combined with Space Frequency Block Code (SFBC) scheme for fourtransmission antennas according to one embodiment of the principles ofthe present invention;

FIG. 10 schematically illustrates a Code Division multiplex (CDM)combined with Space Frequency Block Code (SFBC) scheme for fourtransmission antennas according to another embodiment of the principlesof the present invention;

FIG. 11 schematically illustrates a Code Division multiplex (CDM) schemecombined with a Space Frequency Block Code combined with FrequencySwitched Transmit Diversity (SFBC+FSTD) scheme for four transmissionantennas according to another embodiment of the principles of thepresent invention;

FIG. 12 schematically illustrates procedures for multiplexing andencoding downlink acknowledgement bits according to one embodiment ofthe principles of the present invention; and

FIG. 13 schematically illustrates procedures for multiplexing andencoding downlink acknowledgement bits according to another embodimentof the principles of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The present invention will be described more fully hereinafter withreference to the accompanying drawings, in which preferred embodimentsof the invention are shown. As those skilled in the art would realize,the described embodiments may be modified in various different ways, allwithout departing from the spirit or scope of the present invention.

FIG. 1 illustrates an Orthogonal Frequency Division Multiplexing (OFDM)transceiver chain. In a communication system using OFDM technology, attransmitter chain 110, control signals or data 111 is modulated bymodulator 112 and is serial-to-parallel converted by Serial/Parallel(S/P) converter 113. Inverse Fast Fourier Transform (IFFT) unit 114 isused to transfer the signal from frequency domain to time domain. Cyclicprefix (CP) or zero prefix (ZP) is added to each OFDM symbol by CPinsertion unit 116 to avoid or mitigate the impact due to multipathfading. Consequently, the signal is transmitted by transmitter (Tx)front end processing unit 117, such as an antenna (not shown), oralternatively, by fixed wire or cable. At receiver chain 120, assumingperfect time and frequency synchronization are achieved, the signalreceived by receiver (Rx) front end processing unit 121 is processed byCP removal unit 122. Fast Fourier Transform (FFT) unit 124 transfers thereceived signal from time domain to frequency domain for furtherprocessing.

The total bandwidth in an OFDM system is divided into narrowbandfrequency units called subcarriers. The number of subcarriers is equalto the FFT/IFFT size N used in the system. In general, the number ofsubcarriers used for data is less than N because some subcarriers at theedge of the frequency spectrum are reserved as guard subcarriers. Ingeneral, no information is transmitted on guard subcarriers.

In packet-based wireless data communication systems, a control signalaccompanies a downlink data transmission as shown in FIG. 2. In the3^(rd) Generation Partnership Project Long Term Evolution (3GPP LTE)system, this control channel is referred to as Physical Downlink ControlChannel (PDCCH). As shown in FIG. 2, a Node-B (i.e., base station) 132transmits a data packet and downlink assignment via the PDCCH to a unitof user equipment (UE) 132. The PDCCH carries information such as UEIdentity (ID), resource assignment information, payload size,modulation, Hybrid automatic repeat-request (HARQ) information, andmultiple-input and multiple-output (MIMO) related information. The PDCCHis used for both downlink assignments and uplink scheduling grants asshown in FIG. 2 and FIG. 3 respectively. As shown in FIG. 3, Node-B 142transmits uplink scheduling via the PDCCH to UE 140. In response to theuplink scheduling received, UE 140 transmits a data packet to Node-B142.

In the 3GPP LTE system, some resources, namely control channel elements(CCEs), are reserved for downlink control channel transmission. The CCEsare mapped to subcarriers within the first three OFDM symbols within asubframe as shown in FIG. 4. The number of OFDM symbols allocated forPDCCH transmission can be 1, 2 or 3. Dynamic Category 0 (Cat0) bits is aLTE terminology used in 3GPP LTE standard body. The dynamic Cat0 bitshas a maximum size of 2 bits indicating, for example, allocation of 0,1, 2 or 3 OFDM symbols for PDCCH transmission. In another set-up, Cat0information can also indicate the number of control channel elements(CCEs) allocated for PDCCH transmission. The Cat0 information istransmitted every subframe where a control channel element (CCE) ispresent. The OFDM symbols that are not used for control channeltransmission are used for data transmission. The benefit of Cat0information is that subcarrier resources within the first three OFDMsymbols that are temporarily not used for control informationtransmission can be used for data transmission thus improving systemcapacity and throughput. Note Cat0 is also called Control Channel FormatIndicator (CCFI).

Control channel candidate set can be constructed based on the controlchannel elements reserved for PDCCH. Each downlink assignment or uplinkscheduling grant can be transmitted on one of the control channelcandidate set. An example of control channel elements and controlchannel candidate set is shown in FIG. 5. In this example, elevencontrol channel candidate sets can be constructed based on six controlchannel elements CCE 1, CCE2, . . . , CCE 6. Note that a tree structurecan also be used for the construction of control channel candidates fromcontrol channel elements. Each control channel element can be viewed asa leaf node of the tree. Each control channel candidate can be either aleaf node or an intermediate non-leaf node in the tree. In the rest ofthe document, we will refer to these control channel candidate sets ascontrol channel resource sets, or simply, resource sets.

The methods of diversity in general fall into the following categories:space, angle, polarization, field, frequency, time and multipathdiversity. Space diversity can be achieved by using multiple transmit orreceive antennas. The spatial separation between the multiple antennasis chosen so that the diversity branches experience fading with littleor no correlation. Transmit diversity uses multiple transmissionantennas to provide the receiver with multiple uncorrelated replicas ofthe same signal. Transmit diversity schemes can further be divided intoopen loop transmit diversity and closed-loop transmit diversity schemes.In the open loop transmit diversity scheme, no feedback is required fromthe receiver. In one known arrangement of closed loop transmit diversityscheme, the receiver computes the phase and amplitude adjustment thatshould be applied at the transmitter antennas to maximize the receivedsignal power at the receiver. In another arrangement of closed looptransmit diversity referred to as selection transmit diversity (STD),the receiver provides feedback information to the transmitter onantenna(s) to be used for transmission.

An example of open-loop transmission diversity scheme is the Alamouti2x1 space-time block code (STBC) transmission diversity scheme asillustrated in FIG. 6. In this approach, during any symbol period, i.e.,time period, a transmitter transmits two data symbols via twotransmission antennas to a receiver. As shown in FIG. 6, during thefirst symbol interval t1, symbols S₁ and S₂ are respectively transmittedvia antennas ANT 1 and ANT 2. During the next symbol period t2, symbols−S*₂ and S*₁ are respectively transmitted via antennas ANT 1 and ANT 2,where x* represents complex conjugate of x. After receiving the signals,the receiver performs a plurality of processes to recover originalsymbols S₁ and S₂. Note that the instantaneous channel gains g1 and g2for ANT 1 and ANT 2, respectively, are required for processing at thereceiver. Therefore, the transmitter needs to transmit separate pilotsymbols via both the antennas ANT 1 and ANT 2 for channel gainestimation at the receiver. The diversity gain achieved by Alamouticoding is the same as that achieved in Maximum Ratio Combining (MRC).

The 2x1 Alamouti scheme can also be implemented in a space-frequencyblock code (SFBC) transmission diversity scheme as illustrated in FIG.7. As shown in FIG. 7, symbols S₁ and S₂ are respectively transmitted toa receiver via antennas ANT 1 and ANT 2 on a first subcarrier havingfrequency f1 in an Orthogonal Frequency Division Multiplexing (OFDM)system, symbols −S*₂ and S*₁ are respectively transmitted via antennasANT 1 and ANT 2 on a second subcarrier having frequency f2.

The received signal at the receiver on subcarrier having frequency f1 isr₁, and the received signal at the receiver on subcarrier havingfrequency f2 is r₂. r₁ and r₂ can be written as:

r ₁ =h ₁ s ₁ +h ₂ s ₂ +n ₁

r ₂ =−h ₁ s ₂ *+h ₂ s ₁ *+n ₂,  (1)

where h₁ and h₂ are channel gains from ANT 1 and ANT 2 respectively. Wealso assume that the channel from a given antennas does not changebetween subcarrier having frequency f₁ and subcarrier having frequencyf₂. The receiver performs equalization on the received signals andcombines the two received signals (r₁ and r₂) to recover the symbols S₁and S₂. The recovered symbols S₁ and S₂ can be written as:

$\begin{matrix}\begin{matrix}{{\hat{s}}_{1} = {{h_{1}^{*}r_{1}} + {h_{2}r_{2}^{*}}}} \\{= {{h_{1}^{*}\left( {{h_{1}s_{1}} + {h_{2}s_{2}} + n_{1}} \right)} + {h_{2}\left( {{{- h_{1}}s_{2}^{*}} + {h_{2}s_{1}^{*}} + n_{2}} \right)}^{*}}} \\{= {{\left( {{h_{1}}^{2} + {h_{2}}^{2}} \right)s_{1}} + {h_{1}^{*}n_{1}} + {h_{2}n_{2}^{*}}}} \\{{\hat{s}}_{2} = {{h_{2}^{*}r_{1}} + {h_{1}r_{2}^{*}}}} \\{= {{h_{2}^{*}\left( {{h_{1}s_{1}} + {h_{2}s_{2}} + n_{1}} \right)} + {h_{1}\left( {{{- h_{1}}s_{2}^{*}} + {h_{2}s_{1}^{*}} + n_{2}} \right)}^{*}}} \\{= {{\left( {{h_{1}}^{2} + {h_{2}}^{2}} \right)s_{2}} + {h_{2}^{*}n_{1}} + {h_{1}n_{2}^{*}}}}\end{matrix} & (2)\end{matrix}$

It can be seen that both of the transmitted symbols S₁ and S₂ achievefull spatial diversity, that is, each of the transmitted symbols S₁ andS₂ completely removes an interference from the other one.

In the case of four transmission antennas, the following Space-FrequencyBlock Code combined with Frequency Switched Transmit Diversity(SFBC+FSTD) transmission matrix is adopted in LTE standard according tothe chairman's note of Orlando 3GPP RAN1 meeting:

$\begin{matrix}{{\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}S_{1} & S_{2} & 0 & 0 \\0 & 0 & S_{3} & S_{4} \\{- S_{2}^{*}} & S_{1}^{*} & 0 & 0 \\0 & 0 & {- S_{4}^{*}} & S_{3}^{*}\end{bmatrix}},} & (3)\end{matrix}$

where T_(ij) represents the symbol transmitted on the i-th antenna andthe j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4 for the case of 4-Txantennas.

An equivalent representation of the above SFBC+FSTD transmit signalgiven in equation (1) exists in the following form. Let the transmitsignal vector y(i)=[y⁽⁰⁾(i) y⁽¹⁾(i) y⁽²⁾(i) y⁽³⁾(i)]^(T) denote thetransmit signal vector on four transmission antennas for the i-thsubcarrier. The transmit signal generated from the SFBC+FSTD scheme in(3) can be equivalently written as follows, assuming the transmit signalis mapped to the four consecutive subcarriers 4 i, 4 i+1, 4 i+1, 4 i+3:

$\begin{matrix}{\; {\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix} = {\begin{bmatrix}1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & j & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( S_{1} \right)} \\{{Re}\left( S_{2} \right)} \\{{Re}\left( S_{3} \right)} \\{{Re}\left( S_{4} \right)} \\{{Im}\left( S_{1} \right)} \\{{Im}\left( S_{2} \right)} \\{{Im}\left( S_{3} \right)} \\{{Im}\left( S_{4} \right)}\end{bmatrix}}}} & (4)\end{matrix}$

where Re (x) and Im(x) denotes the real and imaginary parts of thecomplex symbol x.

Code division multiplex (CDM) based Acknowledgement and NegativeAcknowledgement (ACK/NACK) multiplexing and its transmit diversityscheme for two transmission antennas (2Tx) case was proposed in“Performance of DL ACK/NACK transmission”, 3GPP R1-071805, published bySamsung in March 2007, and “Downlink ACK/NACK Transmit diversity”, 3GPPR1-073099, published by Samsung in June 2007. For CDM of ACK/NACKchannels without real and imaginary (I and Q) multiplexing, let b=[b₁, .. . , b₄] be the four ACK bits that are Binary phase-shift keying (BPSK)modulated, let S=[s₁, . . . , s₄] be the unitary spreading matrix whereeach spreading vector s₁, . . . , s₄ is of size 1×4, then the transmitsignal a=[a₁, . . . , a₄] after CDM spreading is given by:

$\begin{matrix}{a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{4}b_{4}}\end{bmatrix}}}} & (5)\end{matrix}$

where W=diag[w₁, . . . , w₄] is a diagonal matrix whose diagonal entriesstarting in the upper left corner are w₁, . . . , w₄. W indicates thetransmission amplitude of the ACK bits.

Furthermore, multiplexing capacity can be doubled if we use both realand imaginary (I and Q) branches to carry different ACK bits withdifferent power settings. To this end, let b_(i)=[b_(1,i), . . . ,b_(4,i)] be the four BPSK-modulated ACK bits to be carried on thei-branch (real branch) and let b_(q)=[b_(1,q), . . . b_(4,q)] be thefour BPSK-modulated ACK bits to be carried on the q-branch (imaginarybranch), let S=[s₁, . . . , s₄] be the unitary spreading matrix whereeach spreading vector s₁, . . . , s₄ is of size 1×4, then the transmitsignal a=[a₁, . . . , a₄] after CDM spreading is given by:

$\begin{matrix}{a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{4,i}b_{4,i}} + {j\; w_{4,q}b_{4,q}}}\end{bmatrix}}}} & (6)\end{matrix}$

where W_(i)=diag└w_(1,i), . . . , w_(4,i)┘ and W_(q)=diag└w_(1,q), . . ., w_(4,q)┘ are two diagonal matrices indicating the transmissionamplitudes of the ACK bits on I and Q branches, respectively.

The example of 2 Tx SFBC transmit diversity with CDMed ACK/NACK channelsare shown below. Take an example of transmit diversity scheme for the 2Tx case with a spreading factor of four (SF4) CDM, assuming the numberof OFDM control symbol is N=1, and the number of repetition is R=4. Ineach transmission, the four symbols a=[a₁, . . . , a₄] are mapped to the4x1 resource unit (RU) using SFBC across both transmission antennas.Note that one resource unit covers four neighboring subcarriers and oneOFDM symbol in the time-frequency resource mapping. The scheme isillustrated in FIG. 8.

In this invention, the CDM ACK/NACK approach does not immediately workwith the 4Tx SFBC+FSTD transmit diversity scheme, since the CDMorthogonality is lost after the 4x SFBC+FSTD operation. Therefore, wepropose several 4Tx transmit diversity schemes that are compatible withthe ACK/NACK CDM multiplexing structure.

Aspects, features, and advantages of the invention are readily apparentfrom the following detailed description, simply by illustrating a numberof particular embodiments and implementations, including the best modecontemplated for carrying out the invention. The invention is alsocapable of other and different embodiments, and its several details canbe modified in various obvious respects, all without departing from thespirit and scope of the invention. Accordingly, the drawings anddescription are to be regarded as illustrative in nature, and not asrestrictive. The invention is illustrated by way of example, and not byway of limitation, in the figures of the accompanying drawings.

In a first embodiment according to the principles of the presentinvention, we propose to use the following two alternating transmitdiversity schemes on the repetitions of the CDMed symbol vector a=[a₁, .. . , a₄], which is the defined as

$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{4}b_{4}}\end{bmatrix}}}$

for the CDM only case, and defined as

$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{4,i}b_{4,i}} + {j\; w_{4,q}b_{4,q}}}\end{bmatrix}}}$

in the CDM+I/Q multiplexing case. The two proposed transmit diversityscheme are given by the following transmission matrices A and B:

$\begin{matrix}{{A = \begin{bmatrix}a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*} \\0 & 0 & 0 & 0\end{bmatrix}},{B = \begin{bmatrix}0 & 0 & 0 & 0 \\a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}}} & (7)\end{matrix}$

Equivalently, the transmission matrices A and B can be respectivelyrepresented by:

$\begin{matrix}{{{A{\text{:}\mspace{14mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & j & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\{{Re}\left( a_{4} \right)} \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\{{Im}\left( a_{4} \right)}\end{bmatrix}}}{{{B{\text{:}\mspace{14mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & j & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\{{Re}\left( a_{4} \right)} \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\{{Im}\left( a_{4} \right)}\end{bmatrix}}},}} & (8)\end{matrix}$

If there are N repetitions of the CDM vector a=[a₁, . . . , a₄], then weassign the transmission matrix A to odd repetitions, and thetransmission matrix B to even repetitions. For example, if we have 4repetitions of a=[a₁, . . . , a₄], we can assign it in an ABAB fashion,in which Matrix A is assigned to Repetition 1, Matrix B is assigned toRepetition 2, Matrix A is assigned to Repetition 3, and Matrix B isassigned to Repetition 4. For the matrices shown in Equation (8), i=2mfor Matrix A, and i=2m+1 for Matrix B, where m is an integer and m>0.Alternatively, we can assign the transmission matrix B to oddrepetitions, and A to even repetitions, e.g., a BABA fashion. For thematrices shown in Equation (8), i=2m+1 for Matrix A, and i=2m for MatrixB, where m is an integer and m>0.

In a second embodiment according to the principles of the presentinvention, if the number of repetitions of the CDMed vector a=[a₁, . . ., a₄] is even, then we propose to always map same number of repetitionsin the OFDM symbols that carries these repetitions, in order to keep thepower amplifier (PA) balanced for all transmission antennas. Inaddition, the alternating transmit diversity schemes A and B are appliedin each one OFDM symbol. In the example of four repetitions, we proposefour ways of mapping the repetitions to the physical resource elements(Res) within the first three OFDM symbols:

1. map all 4 repetitions to OFDM symbol #0

2. map 2 repetitions each to OFDM symbols #0 and #1;

3. map 2 repetitions each to OFDM symbols #1 and #2; and

4. map 2 repetitions each to OFDM symbols #0 and #2.

In FIG. 9, the 4Tx transmit diversity of CDMed ACK/NACK vector with SF4is illustrated for the case where all four repetitions are mapped ontothe first OFDM symbol #0. In FIG. 10, the 4Tx transmit diversity ofCDMed ACK/NACK vector with SF4 is illustrated for the case where thefirst two repetitions are mapped onto the OFDM symbol #0, and the othertwo repetitions are mapped onto the OFDM symbol #2.

In a third embodiment according to the principles of the presentinvention shown in FIG. 11, SFBC-FSTD mapping changes on repetitions.The two transmission matrices A and B in the two SFBC-FSTD schemes canbe respectively represented by:

$\begin{matrix}{{A = \begin{bmatrix}a_{1} & a_{2} & 0 & 0 \\0 & 0 & a_{3} & a_{4} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}},{B = \begin{bmatrix}0 & 0 & a_{3} & a_{4} \\a_{1} & a_{2} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0\end{bmatrix}}} & (9)\end{matrix}$

This scheme allows capturing full space and frequency diversity at theexpense of some loss of orthogonality of the CDM ACK/NACKs.

In a fourth embodiment according to the principles of the presentinvention, we propose to use a different CDM method and transmitdiversity scheme for the ACK/NACK bits in the downlink. As illustratedin FIG. 12, at first, a CDM scheme of SF length 3 is used to multiplexthe ACK bits to be transmitted (step 210). Then, a spatial rate %orthogonal SFBC code (that is different from any of the SFBC codediscussed above) is applied to the CDMed symbol (step 220). The ¾orthogonal SFBC code is output by three repetitions (step 230).Afterwards, the three repetitions are mapped either to the first OFDMsymbol #0 (step 240), or to the three OFDM symbols respectively, in away such that each OFDM will contain one repetition (step 250). Ineither case, the PA balance is always achieved in this proposed schemefor each repetition. In addition, for each repetition, the full 4^(th)order diversity is obtained.

The SF3 CDM without I/Q multiplexing is described as follows. Let b=[b₁,. . . , b₃] be the three ACK bits that are BPSK-modulated, let S=[s₁, .. . , s₃] be the unitary spreading matrix where each spreading vectors₁, . . . , s₃ is of size 1×3, then the transmit signal a=[a₁, . . . ,a₃] after CDM spreading is given by:

$\begin{matrix}{a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{3}b_{3}}\end{bmatrix}}}} & (10)\end{matrix}$

where W=diag[w₁, . . . , w₃] is a diagonal matrix indicating thetransmission amplitude of the ACK bits. One example of the set of SF3spreading codes is s₁=[1,1,1]^(T), s₂=[1, e^(j2π/3), e^(j4π/3)]^(T),s₂=[1, e^(j4π/3), e^(j8π/3)]^(T).

Furthermore, multiplexing capacity can be doubled if we use both I and Q(real and imaginary) branches to carry different ACK bits with differentpower setting. To this end, let b_(i)=[b_(1,i), . . . , b_(3,i)] be thethree. BPSK-modulated ACK bits to be carried on the i-branch (realbranch) and let b_(q)=[b_(1,q), . . . , b_(3,q)] be the threeBPSK-modulated ACK bits to be carried on the q-branch (imaginarybranch), let S=[s₁, . . . , s₃] be the unitary spreading matrix whereeach spreading vector s₁, . . . , s₃ is of size 1×3, then the transmitsignal a=[a₁, . . . , a₃] after CDM spreading is given by:

$\begin{matrix}{a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{3,i}b_{3,i}} + {j\; w_{3,q}b_{3,q}}}\end{bmatrix}}}} & (11)\end{matrix}$

where W_(i)=diag└w_(1,i), . . . , w_(3,i)┘ and W_(q)=diag└w_(1,q), . . ., w_(3,q)┘ are two diagonal matrices indicating the transmissionamplitudes of the ACK bits on I and Q branches, respectively.

One example of the rate ¾ Orthogonal Space-Frequency Block Code (OSFBC)is given by matrix C:

$\begin{matrix}{C = \begin{bmatrix}a_{1} & 0 & a_{2} & {- a_{3}} \\0 & a_{1} & a_{3}^{*} & a_{2}^{*} \\{- a_{2}^{*}} & {- a_{3}} & a_{1}^{*} & 0 \\a_{3}^{*} & {- a_{2}} & 0 & a_{1}^{*}\end{bmatrix}} & (12)\end{matrix}$

The equivalent precoding representation for the matrix C is given by:

$\begin{matrix}{{C{\text{:}\mspace{20mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 \\0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 \\1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 \\0 & 1 & 0 & 0 & 0 & {- j} & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\{{Re}\left( a_{4} \right)} \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\{{Im}\left( a_{4} \right)}\end{bmatrix}}} & (13)\end{matrix}$

Note that in the above equation, a₄ is not presented in the CDMed symbola. Therefore, the matrix C may be given by:

$\begin{matrix}{{C{\text{:}\mspace{14mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & {- 1} & 0 & 0 & 0 & j & 0 \\0 & {- 1} & 0 & 0 & 0 & {- j} & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 \\1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & {- 1} & 0 & 0 & 0 & {- j} & 0 \\0 & 1 & 0 & 0 & 0 & {- j} & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & {- j} & 0 & 0 & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\0 \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\0\end{bmatrix}}} & (14)\end{matrix}$

In a fifth embodiment according to the principles of the presentinvention as illustrated in FIG. 13, we again propose to use CDM with SFlength 3 to multiplex the ACK bits (step 310), followed by a spatialrate ¾ Orthogonal Space-Frequency Block Code (OSFBC) code (step 320). Anarbitrary number of N repetitions, however, is allowed at the output ofthe ¾ orthogonal SFBC code (step 330). Afterwards, the N repetitions aremapped either to the first OFDM symbol #0 (step 340), or to the threeOFDM symbols in a way such that each OFDM will contain roughly equalamount of repetitions (step 350). For example, let n=1, . . . , N be theindex of the repetitions, then the index, k(n), of the OFDM symbolmapped to the n-th repetition may be:

$\begin{matrix}{{k(n)} = \left\{ {\begin{matrix}0 & {{{if}\mspace{14mu} n} \leq \left\lceil {N\text{/}3} \right\rceil} \\1 & {{{if}\mspace{14mu} n} \leq {2 \cdot \left\lceil {N\text{/}3} \right\rceil}} \\2 & {{{if}\mspace{14mu} n} > {2 \cdot \left\lceil {N\text{/}3} \right\rceil}}\end{matrix}.} \right.} & (15)\end{matrix}$

Alternatively, the index, k(n), of the OFDM symbol mapped to the n-threpetition may be:

k(n)=mod(N−1,3).  (16)

While the present invention has been shown and described in connectionwith the preferred embodiments, it will be apparent to those skilled inthe art that modifications and variations can be made without departingfrom the spirit and scope of the invention as defined by the appendedclaims.

1. A method for transmitting data, the method comprising the steps of:multiplexing a plurality of information bits to be transmitted by usingone of a first code division multiplexing scheme and a second codedivision multiplexing scheme combined with a real and imaginarymultiplexing scheme, to generate a code division multiplexed symbol acomprising four vectors a=[a₁, . . . , a₄]; and repeatedly transmittingthe code division multiplexed symbol a by alternatively applying twotransmit diversity schemes via four transmission antennas, with: in afirst transmit diversity scheme, a transmit signal being established by:${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*} \\0 & 0 & 0 & 0\end{bmatrix}},$  where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4;and in a second transmit diversity scheme, a transmit signal beingestablished by: $\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}0 & 0 & 0 & 0 \\a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}$  where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3,
 4. 2.The method of claim 1, comprised of, in accordance with the first codedivision multiplexing scheme, the code division multiplexed symbol abeing established by:$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{4}b_{4}}\end{bmatrix}}}$ where b=[b₁, . . . , b₄] indicates the four informationbits, S=[s₁, . . . , s₄] indicates a unitary spreading matrix where eachspreading vector s₁, . . . , s₄ is of size 1×4, W=diag[w₁, . . . , w₄]is a diagonal matrix indicating transmission amplitudes of theinformation bits.
 3. The method of claim 1, comprised of, in accordancewith the second code division multiplexing scheme combined with the realand imaginary multiplexing scheme, the code division multiplexed symbola being established by:$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{4,i}b_{4,i}} + {j\; w_{4,q}b_{4,q}}}\end{bmatrix}}}$ where b_(i)=[b_(1,i), . . . , b_(4,i)] indicates thefour information bits to be carried on a real branch, b_(q)=[b_(1,q), .. . , b_(4,q)] indicates the four information bits to be carried on animaginary branch, S=[s₁, . . . , s₄] indicates a unitary spreadingmatrix where each spreading vector s₁, . . . , s₄ is of size 1×4, andW_(i)=diag└w_(1,i), . . . , w_(4,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(4,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.4. The method of claim 1, comprised of applying the first transmitdiversity scheme on even-numbered repetitions, and applying the secondtransmit diversity scheme on odd-numbered repetitions.
 5. The method ofclaim 4, comprised of: the transmit signal according to the firsttransmit diversity being established by:${{A{\text{:}\mspace{14mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & j & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\{{Re}\left( a_{4} \right)} \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\{{Im}\left( a_{4} \right)}\end{bmatrix}}},$  where y(i)=[y⁽⁰⁾(i) y⁽¹⁾(i) y⁽²⁾(i) y⁽³⁾(i)]^(T)indicates the transmit signal vector on four transmission antennas forthe i-th subcarrier; and the transmit signal according to the firsttransmit diversity being established by:${{B{\text{:}\mspace{14mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & j & 0 \\0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\{{Re}\left( a_{4} \right)} \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\{{Im}\left( a_{4} \right)}\end{bmatrix}}},$  where y(i)=[y⁽⁰⁾(i) y⁽¹⁾(i) y⁽²⁾(i) y⁽³⁾(i)]^(T)indicates the transmit signal vector on four transmission antennas forthe i-th subcarrier.
 6. The method of claim 1, comprised of applying thefirst transmit diversity scheme on odd-numbered repetitions, andapplying the second transmit diversity scheme on even-numberedrepetitions.
 7. The method of claim 6, comprised of: the transmit signalaccording to the first transmit diversity being established by:${{A{\text{:}\mspace{14mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & j & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\{{Re}\left( a_{4} \right)} \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\{{Im}\left( a_{4} \right)}\end{bmatrix}}},$  where y(i)=[y⁽⁰⁾(i) y⁽¹⁾(i) y⁽²⁾(i) y⁽³⁾(i)]^(T)indicates the transmit signal vector on four transmission antennas forthe i-th subcarrier, and the transmit signal according to the firsttransmit diversity being established by:${{B{\text{:}\mspace{14mu}\begin{bmatrix}{y^{(0)}\left( {4i} \right)} \\{y^{(1)}\left( {4i} \right)} \\{y^{(2)}\left( {4i} \right)} \\{y^{(3)}\left( {4i} \right)} \\{y^{(0)}\left( {{4i} + 1} \right)} \\{y^{(1)}\left( {{4i} + 1} \right)} \\{y^{(2)}\left( {{4i} + 1} \right)} \\{y^{(3)}\left( {{4i} + 1} \right)} \\{y^{(0)}\left( {{4i} + 2} \right)} \\{y^{(1)}\left( {{4i} + 2} \right)} \\{y^{(2)}\left( {{4i} + 2} \right)} \\{y^{(3)}\left( {{4i} + 2} \right)} \\{y^{(0)}\left( {{4i} + 3} \right)} \\{y^{(1)}\left( {{4i} + 3} \right)} \\{y^{(2)}\left( {{4i} + 3} \right)} \\{y^{(3)}\left( {{4i} + 3} \right)}\end{bmatrix}}} = {\begin{bmatrix}0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\1 & 0 & 0 & 0 & j & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & {- 1} & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & j & 0 & 0 \\0 & 0 & 0 & 0 & {- j} & 0 & 0 & 0 \\1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 0 & 0 & 0 & j & 0 \\0 & 0 & 0 & {- 1} & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 0 & j \\0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & {- j} & 0\end{bmatrix}\begin{bmatrix}{{Re}\left( a_{1} \right)} \\{{Re}\left( a_{2} \right)} \\{{Re}\left( a_{3} \right)} \\{{Re}\left( a_{4} \right)} \\{{Im}\left( a_{1} \right)} \\{{Im}\left( a_{2} \right)} \\{{Im}\left( a_{3} \right)} \\{{Im}\left( a_{4} \right)}\end{bmatrix}}},$  where y(i)=[y⁽⁰⁾(i) y⁽¹⁾(i) y⁽²⁾(i) y⁽³⁾(i)]^(T)indicates the transmit signal vector on four transmission antennas forthe i-th subcarrier.
 8. The method of claim 1, comprised of:transmitting the code division multiplexed symbol a via at least onetime unit among a plurality of time units within a subframe; when thecode division multiplexed symbol a is transmitted via more than one timeunit, and when the number of repetitions is even, transmitting the samenumber of repetitions in the more than one time unit by alternativelyapplying the two transmit diversity schemes in each time unit.
 9. Amethod for transmitting data, the method comprising the steps of:multiplexing a plurality of bits to be transmitted by using one of afirst code division multiplexing scheme and a second code divisionmultiplexing scheme combined with a real and imaginary multiplexingscheme, to generate a code division multiplexed symbol a comprising fourvectors a=[a₁, . . . , a₄]; and repeatedly transmitting the codedivision multiplexed symbol a by alternatively applying two transmitdiversity schemes via four transmission antennas, with: in a firsttransmit diversity scheme, a transmit signal being established by:${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & a_{2} & 0 & 0 \\0 & 0 & a_{3} & a_{4} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}},$  where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4;and in a second transmit diversity scheme, a transmit signal beingestablished by: $\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}0 & 0 & a_{3} & a_{4} \\a_{1} & a_{2} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0\end{bmatrix}$  where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4.10. The method of claim 9, comprised of, in accordance with the firstcode division multiplexing scheme, the code division multiplexed symbola being established by:$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{4}b_{4}}\end{bmatrix}}}$ where b=[b₁, . . . , b₄] indicates the four informationbits, S=[s₁, . . . , s₄] indicates a unitary spreading matrix where eachspreading vector s₁, . . . , s₄ is of size 1×4, W=diag[w₁, . . . , w₄]is a diagonal matrix indicating transmission amplitudes of theinformation bits.
 11. The method of claim 9, comprised of, in accordancewith the second code division multiplexing scheme combined with the realand imaginary multiplexing scheme, the code division multiplexed symbola being established by:$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{4,i}b_{4,i}} + {j\; w_{4,q}b_{4,q}}}\end{bmatrix}}}$ where b_(i)=[b_(1,i), . . . , b_(4,i)] indicates thefour information bits to be carried on a real branch, b_(q)=[b_(1,q), .. . , b_(4,q)] indicates the four information bits to be carried on animaginary branch, S=[s₁, . . . , s₄] indicates a unitary spreadingmatrix where each spreading vectors s₁, . . . , s₄ is of size 1×4, andW_(i)=diag└w_(1,i), . . . , w_(4,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(4,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.12. The method of claim 9, comprised of applying the first transmitdiversity scheme on even-numbered repetitions, and applying the secondtransmit diversity scheme on odd-numbered repetitions.
 13. The method ofclaim 9, comprised of applying the first transmit diversity scheme onodd-numbered repetitions, and applying the second transmit diversityscheme on even-numbered repetitions.
 14. The method of claim 9,comprised of: transmitting the code division multiplexed symbol a via atleast one time unit among a plurality of time units within a subframe;when the code division multiplexed symbol a is transmitted via more thanone time unit, and when the number of repetitions is even, transmittingthe same number of repetitions in the more than one time unit byalternatively applying the two transmit diversity schemes in each timeunit.
 15. A method for transmitting data, the method comprising thesteps of: multiplexing a plurality of information bits to be transmittedby using one of a first code division multiplexing scheme and a secondcode division multiplexing scheme combined with a real and imaginarymultiplexing scheme, to generate a code division multiplexed symbol acomprising three vectors a=[a₁, . . . , a₃]; and repeatedly transmittingthe code division multiplexed symbol a by applying a transmit diversityscheme via four transmission antennas, with the transmit signal beingestablished by: ${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & 0 & a_{2} & {- a_{3}} \\0 & a_{1} & a_{3}^{*} & a_{2}^{*} \\{- a_{2}^{*}} & {- a_{3}} & a_{1}^{*} & 0 \\a_{3}^{*} & {- a_{2}} & 0 & a_{1}^{*}\end{bmatrix}},$ where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4.16. The method of claim 15, comprised of, in accordance with the firstcode division multiplexing scheme, the code division multiplexed symbola being established by:$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{3}b_{3}}\end{bmatrix}}}$ where b=[b₁, . . . , b₃] indicates the four informationbits, S=[s₁, . . . , s₃] indicates a unitary spreading matrix where eachspreading vector s₁, . . . , s₃ is of size 1×3, W=diag[w₁, . . . , w₃]is a diagonal matrix indicating transmission amplitudes of theinformation bits.
 17. The method of claim 15, comprised of, inaccordance with the second code division multiplexing scheme combinedwith the real and imaginary multiplexing scheme, the code divisionmultiplexed symbol a being established by:$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{3,i}b_{3,i}} + {j\; w_{3,q}b_{3,q}}}\end{bmatrix}}}$ where b_(i)=[b_(1,i), . . . , b_(3,i)] indicates thefour information bits to be carried on a real branch, b_(q)=[b_(1,q), .. . , b_(3,q)] indicates the four information bits to be carried on animaginary branch, S=[s₁, . . . , s₃] indicates a unitary spreadingmatrix where each spreading vector s₁, . . . , s₃ is of size 1×3, andW_(i)=diag└w_(1,i), . . . , w_(3,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(3,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.18. The method of claim 15, comprised of transmitting the code divisionmultiplexed symbol a for three repetitions in a time unit among aplurality of time units within a subframe.
 19. The method of claim 15,comprised of transmitting the code division multiplexed symbol a forthree repetitions in three time units among a plurality of time unitswithin a subframe, with each repetition corresponding to one time unit.20. The method of claim 15, comprised of transmitting the code divisionmultiplexed symbol a for a plurality of repetitions in a time unit amonga plurality of time units within a subframe.
 21. The method of claim 15,comprised of transmitting the code division multiplexed symbol a for aplurality of repetitions in three time units among a plurality of timeunits within a subframe, by assigning roughly equal number ofrepetitions to each one of the three time units.
 22. The method of claim21, comprised of an index, k(n), of the time unit assigned to an n-threpetition being established by: ${k(n)} = \left\{ {\begin{matrix}0 & {{{if}\mspace{14mu} n} \leq \left\lceil {N\text{/}3} \right\rceil} \\1 & {{{if}\mspace{14mu} n} \leq {2 \cdot \left\lceil {N\text{/}3} \right\rceil}} \\2 & {{{if}\mspace{14mu} n} > {2 \cdot \left\lceil {N\text{/}3} \right\rceil}}\end{matrix},} \right.$ where N is the total number of the repetitions.23. The method of claim 21, comprised of an index, k(n), of the timeunit assigned to an n-th repetition being established by:k(n)=mod(N−1,3), where N is the total number of the repetitions.
 24. Awireless terminal in a communication system, comprising: a multiplexingunit multiplexing a plurality of information bits to be transmitted byusing one of a first code division multiplexing scheme and a second codedivision multiplexing scheme combined with a real and imaginarymultiplexing scheme, to generate a code division multiplexed symbol acomprising four vectors a=[a₁, . . . , a₄]; a transmission processingunit processing the code division multiplexed symbol a by applying twotransmit diversity schemes to generate two transmit signals, with: afirst transmit signal generated in accordance with a first transmitdiversity scheme being established by: ${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*} \\0 & 0 & 0 & 0\end{bmatrix}},$  where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4;and a second transmit signal generated in accordance with a secondtransmit diversity scheme being established by: $\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}0 & 0 & 0 & 0 \\a_{1} & a_{2} & a_{3} & a_{4} \\0 & 0 & 0 & 0 \\{- a_{2}^{*}} & a_{1}^{*} & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}$ where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4;and four transmission antennas alternatively transmitting the firsttransmit signal and the second transmit signal for a plurality ofrepetitions.
 25. The wireless terminal of claim 24, comprised of, inaccordance with the first code division multiplexing scheme, the codedivision multiplexed symbol a being established by:$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{4}b_{4}}\end{bmatrix}}}$ where b=[b₁, . . . , b₄] indicates the four informationbits, S=[s₁, . . . , s₄] indicates a unitary spreading matrix where eachspreading vector s₁, . . . , s₄ is of size 1×4, W=diag[w₁, . . . , w₄]is a diagonal matrix indicating transmission amplitudes of theinformation bits.
 26. The wireless terminal of claim 24, comprised of,in accordance with the second code division multiplexing scheme combinedwith the real and imaginary multiplexing scheme, the code divisionmultiplexed symbol a being established by:$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{4,i}b_{4,i}} + {j\; w_{4,q}b_{4,q}}}\end{bmatrix}}}$ where b=[b_(1,i), . . . , b_(4,i)] indicates the fourinformation bits to be carried on a real branch, b_(q)=[b_(1,q), . . . ,b_(4,q)] indicates the four information bits to be carried on animaginary branch, S=[s₁, . . . , s₄] indicates a unitary spreadingmatrix where each spreading vector s₁, . . . , s₄ is of size 1×4, andW_(i)=diag└w_(1,i), . . . , w_(4,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(4,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.27. The wireless terminal of claim 24, comprised of the fourtransmission antennas transmitting the first transmit signal oneven-numbered repetitions, and transmitting the second transmit signalon odd-numbered repetitions.
 28. The wireless terminal of claim 24,comprised of the four transmission antennas transmitting the firsttransmit signal on odd-numbered repetitions, and transmitting the secondtransmit signal on even-numbered repetitions.
 29. The wireless terminalof claim 24, comprised of: transmitting the code division multiplexedsymbol a via at least one time unit among a plurality of time unitswithin a subframe; when the code division multiplexed symbol a istransmitted via more than one time unit, and when the number ofrepetitions is even, transmitting the same number of repetitions in themore than one time unit by alternatively applying the two transmitdiversity schemes in each time unit.
 30. A wireless terminal in acommunication system, comprising: a multiplexing unit multiplexing aplurality of information bits to be transmitted by using one of a firstcode division multiplexing scheme and a second code divisionmultiplexing scheme combined with a real and imaginary multiplexingscheme, to generate a code division multiplexed symbol a comprising fourvectors a=[a₁, . . . , a₄]; a transmission processing unit processingthe code division multiplexed symbol a by applying two transmitdiversity schemes to generate two transmit signals, with: a firsttransmit signal generated in accordance with a first transmit diversityscheme being established by: ${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & a_{2} & 0 & 0 \\0 & 0 & a_{3} & a_{4} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*}\end{bmatrix}},$  where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4;and a second transmit signal generated in accordance with a secondtransmit diversity scheme being established by: $\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}0 & 0 & a_{3} & a_{4} \\a_{1} & a_{2} & 0 & 0 \\0 & 0 & {- a_{4}^{*}} & a_{3}^{*} \\{- a_{2}^{*}} & a_{1}^{*} & 0 & 0\end{bmatrix}$ where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4;and four transmission antennas alternatively transmitting the firsttransmit signal and the second transmit signal for a plurality ofrepetitions.
 31. The wireless terminal of claim 30, comprised of, inaccordance with the first code division multiplexing scheme, the codedivision multiplexed symbol a being established by:$a = {{SWb} = {\left\lbrack {s_{1},\ldots,\mspace{14mu} s_{4}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{4}b_{4}}\end{bmatrix}}}$ where b=[b₁, . . . , b₄] indicates the four informationbits, S=[s₁, . . . , s₄] indicates a unitary spreading matrix where eachspreading vector S₁, . . . , s₄ is of size 1×4, W=diag[w₁, . . . , w₄]is a diagonal matrix indicating transmission amplitudes of theinformation bits.
 32. The wireless terminal of claim 30, comprised of,in accordance with the second code division multiplexing scheme combinedwith the real and imaginary multiplexing scheme, the code divisionmultiplexed symbol a being established by:$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{4}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{4,i}b_{4,i}} + {j\; w_{4,q}b_{4,q}}}\end{bmatrix}}}$ where b₁=[b_(1,i), . . . , b_(4,i)] indicates the fourinformation bits to be carried on a real branch, b_(q)=[b_(1,q), . . . ,b_(4,q)] indicates the four information bits to be carried on animaginary branch, S=[s₁, . . . , s₄] indicates a unitary spreadingmatrix where each spreading vector s₁, . . . , s₄ is of size 1×4, andW_(i)=diag└w_(1,i), . . . , w_(4,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(4,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.33. The wireless terminal of claim 30, comprised of the fourtransmission antennas transmitting the first transmit signal oneven-numbered repetitions, and transmitting the second transmit signalon odd-numbered repetitions.
 34. The wireless terminal of claim 30,comprised of the four transmission antennas transmitting the firsttransmit signal on odd-numbered repetitions, and transmitting the secondtransmit signal on even-numbered repetitions.
 35. The wireless terminalof claim 30, comprised of: transmitting the code division multiplexedsymbol a via at least one time unit among a plurality of time unitswithin a subframe; when the code division multiplexed symbol a istransmitted via more than one time unit, and when the number ofrepetitions is even, transmitting the same number of repetitions in themore than one time unit by alternatively applying the two transmitdiversity schemes in each time unit.
 36. A wireless terminal in acommunication system, comprising: a multiplexing unit multiplexing aplurality of information bits to be transmitted by using one of a firstcode division multiplexing scheme and a second code divisionmultiplexing scheme combined with a real and imaginary multiplexingscheme, to generate a code division multiplexed symbol a comprisingthree vectors a=[a₁, . . . , a₃], and a transmission processing unitprocessing the code division multiplexed symbol a by applying a transmitdiversity scheme to generate a transmit signal established by:${\begin{bmatrix}T_{11} & T_{12} & T_{13} & T_{14} \\T_{21} & T_{22} & T_{23} & T_{24} \\T_{31} & T_{32} & T_{33} & T_{34} \\T_{41} & T_{42} & T_{43} & T_{44}\end{bmatrix} = \begin{bmatrix}a_{1} & 0 & a_{2} & {- a_{3}} \\0 & a_{1} & a_{3}^{*} & a_{2}^{*} \\{- a_{2}^{*}} & {- a_{3}} & a_{1}^{*} & 0 \\a_{3}^{*} & {- a_{2}} & 0 & a_{1}^{*}\end{bmatrix}},$  where T_(ij) represents the symbol transmitted on thei-th antenna and the j-th subcarrier, and i=1, 2, 3, 4, j=1, 2, 3, 4;and four transmission antennas transmitting the transmit signal for aplurality of repetitions.
 37. The wireless terminal of claim 36,comprised of, in accordance with the first code division multiplexingscheme, the code division multiplexed symbol a being established by:$a = {{SWb} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{w_{1}b_{1}} \\\vdots \\{w_{3}b_{3}}\end{bmatrix}}}$ where b=[b₁, . . . , b₃] indicates the four informationbits, S=[s₁, . . . , s₃] indicates a unitary spreading matrix where eachspreading vector s₁, . . . s₃ is of size 1×3, W=diag[w₁, . . . , w₃] isa diagonal matrix indicating transmission amplitudes of the informationbits.
 38. The wireless terminal of claim 36, comprised of, in accordancewith the second code division multiplexing scheme combined with the realand imaginary multiplexing scheme, the code division multiplexed symbola being established by:$a = {{S\left( {{W_{i}b_{i}} + {j\; W_{q}b_{q}}} \right)} = {\left\lbrack {s_{1},\ldots \mspace{14mu},s_{3}} \right\rbrack \begin{bmatrix}{{w_{1,i}b_{1,i}} + {j\; w_{1,q}b_{1,q}}} \\\vdots \\{{w_{3,i}b_{3,i}} + {j\; w_{3,q}b_{3,q}}}\end{bmatrix}}}$ where b_(i)=[b_(1,i), . . . , b_(3,i)] indicates thefour information bits to be carried on a real branch, b_(q)=[b_(1,q), .. . , b_(3,q)] indicates the four information bits to be carried on animaginary branch, S=[s₁, . . . , s₃] indicates a unitary spreadingmatrix where each spreading vector s₁, . . . , s₃ is of size 1×3, andW_(i)=diag└w_(1,i), . . . , w_(3,i)┘ and W_(q)=diag└w_(1,q), . . . ,w_(3,q)┘ are two diagonal matrices indicating transmission amplitudes ofthe information bits on the real and imaginary branches, respectively.39. The wireless terminal of claim 36, comprised of the fourtransmission antennas transmitting the code division multiplexed symbola for three repetitions in a time unit among a plurality of time unitswithin a subframe.
 40. The wireless terminal of claim 36, comprised ofthe four transmission antennas transmitting the code divisionmultiplexed symbol a for three repetitions in three time units among aplurality of time units within a subframe, with each repetitioncorresponding to one time unit.
 41. The wireless terminal of claim 36,comprised of the four transmission antennas transmitting the codedivision multiplexed symbol a for a plurality of repetitions in a timeunit among a plurality of time units within a subframe.
 42. The wirelessterminal of claim 36, comprised of the four transmission antennastransmitting the code division multiplexed symbol a for a plurality ofrepetitions in three time units among a plurality of time units within asubframe, by assigning roughly equal number of repetitions to each oneof the three time units.
 43. The wireless terminal of claim 42,comprised of an index, k(n), of the time unit assigned to an n-threpetition being established by: ${k(n)} = \left\{ {\begin{matrix}0 & {{{if}\mspace{14mu} n} \leq \left\lceil {N\text{/}3} \right\rceil} \\1 & {{{if}\mspace{14mu} n} \leq {2 \cdot \left\lceil {N\text{/}3} \right\rceil}} \\2 & {{{if}\mspace{14mu} n} > {2 \cdot \left\lceil {N\text{/}3} \right\rceil}}\end{matrix},} \right.$ where N is the total number of the repetitions.44. The wireless terminal of claim 42, comprised of an index, k(n), ofthe time unit assigned to an n-th repetition being established by:k(n)=mod(N−1,3), where N is the total number of the repetitions.